Random Effects Graphical Models for Multiple Site Sampling∗†
نویسندگان
چکیده
We propose a two component graphical chain model, the discrete regression distribution, in which a set of categorical (or discrete) random variables is modeled as a response to a set of categorical and continuous covariates. We examine necessary and sufficient conditions for a discrete regression distribution to be described by a given graph. The discrete regression formulation is extended to a state-space representation for the analysis of data collected at many random sites. In addition, some new results concerning marginalization in chain graph models are explored. Using the new results, we examine the Markov properties of the extended model as well as the marginal model of covariates and responses.
منابع مشابه
Multi-floor Indoor Positioning System Using Bayesian Graphical Models
In recent years, location determination systems have gained a high importance due to their rule in the context aware systems. In this paper, we will design a multi-floor indoor positioning system based on Bayesian Graphical Models (BGM). Graphical models have a great flexibility on visualizing the relationships between random variables. Rather than using one sampling technique, we are going to ...
متن کاملBayesian Matrix Factorization with Non-Random Missing Data using Informative Gaussian Process Priors and Soft Evidences
We propose an extended Bayesian matrix factorization method, which can incorporate multiple sources of side information, combine multiple a priori estimates for the missing data and integrates a flexible missing not at random submodel. The model is formalized as probabilistic graphical model and a corresponding Gibbs sampling scheme is derived to perform unrestricted inference. We discuss the a...
متن کاملEstimating the Partition Function of Graphical Models Using Langevin Importance Sampling
Graphical models are powerful in modeling a variety of real-world applications. Computing the partition function of a graphical model is known as an NP-hard problem for a general graph. A few sampling algorithms like Markov chain Monte Carlo (MCMC), Simulated Annealing Sampling (SAS), Annealed Importance Sampling (AIS) are developed to approximate the partition function. This paper presents a n...
متن کاملImproving distance sampling: accounting for covariates and nonindependency between sampled sites
1. There is currently much interest in replacing the design-based component of conventional distance sampling methods by a modelling approach where animal densities are related to environmental covariates. These models allow identification of relationships between density and covariates. One of the uses of such models is to assess the effects of some intervention on numbers for species of conse...
متن کاملUsing Bayesian Network Representations for Effective Sampling from Generative Network Models
Bayesian networks (BNs) are used for inference and sampling by exploiting conditional independence among random variables. Context specific independence (CSI) is a property of graphical models where additional independence relations arise in the context of particular values of random variables (RVs). Identifying and exploiting CSI properties can simplify inference. Some generative network model...
متن کامل